Benders' cuts guided large neighborhood search for the traveling umpire problem

This article introduces the use of Benders' cuts to guide a large neighborhood search to solve the traveling umpire problem, a sports scheduling problem inspired by the real‐life needs of the officials of a sports league. At each time slot, a greedy matching heuristic is used to construct a schedule. When an infeasibility is recognized first a single step backtracking is tried to resolve the infeasibility. If unsuccessful, Benders' cuts are generated to guide a large neighborhood search to ensure feasibility and to improve the solution. Realizing the inherent symmetry present in the problem, a large family of cuts are generated and their effectiveness is tested. The resulting approach is able to find better solutions to many instances of this problem. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

舰载无人机光电载荷对海搜索方式与搜索宽度

搜索方式与搜索宽度是舰载无人机对海搜索效率与搜索力配置研究的基础。基于舰载无人机及其光电载荷的性能特点,提出了舰载无人机对海搜索的七种基本搜索方式,并从不同的角度对舰载无人机对海搜索方式进行了分类,给出了搜索方式的选择方法;建立了舰载无人机光电载荷搜索宽度计算模型,为舰载无人机系统采用不同的搜索方式进行搜索时计算其搜索效率和搜索力的配置提供了决策依据。     

学术论文摘要与关键词规范化浅析

摘要是从论文中提炼出来的语义完整的概括文章主旨的紧缩性短语的短文;关键词是从报告、论文中选取出来的,用以表示全文主题内容信息的词或词组。摘要、关键词是文献检索的重要标识,具有窥一斑而见全豹的作用。读者只要浏览摘要及关键词,便可了解文章大意,决定是否阅读全文。二者都是为文献检索提供信息或直接为某些文章所转摘。所以,应按照规范要求,把握摘要四要素,认真撰写摘要,准确选取关键词。将文献信息全面、准确、清晰地提供给读者,提高文献转摘率和被引用率。     

基于飞蛾信息素寻偶机制的无人机集群协同搜索

为了提高无人机集群协同搜索移动目标的效率,提出一种基于飞蛾信息素寻偶机制的无人机集群协同搜索方法。根据飞蛾基于信息素选择飞行方向的寻偶行为,建立信息素图风向模型和飞蛾信息素寻偶模型。考虑无人机机间避撞约束,提出从飞蛾信息素寻偶机制到无人机集群分布式协同搜索的映射,并给出具体实现流程。仿真实验结果表明了所提方法在解决单个移动目标的协同搜索问题时的有效性和稳定性;外场飞行试验表明了所提方法在实际应用中的可行性。     

机载红外搜索跟踪系统

红外搜索和跟踪（ＩＲＳＴ） 系统是迅速探测红外威胁源的存在, 识别威胁源的种类,测定威胁源的方位并报警的一种光电系统。介绍了对机载ＩＲＳＴ的性能要求, 美国和欧洲等国对机载ＩＲＳＴ的研制及装备概况, 分析了今后机载ＩＲＳＴ系统的发展方向。     

Constrained minimax optimization of continuous search efforts for the detection of a stationary target

Analytical resolution of search theory problems, as formalized by B.O. Koopman, may be applied with some model extension to various resource management issues. However, a fundamental prerequisite is the knowledge of the prior target density. Though this assumption has the definite advantage of simplicity, its drawback is clearly that target reactivity is not taken into account. As a preliminary step towards reactive target study stands the problem of resource planning under a min–max game context. This paper is related to Nakai's work about the game planning of resources for the detection of a stationary target. However, this initial problem is extended by adding new and more general constraints, allowing a more realistic modeling of the target and searcher behaviors. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

Technical note: Find a hidden “treasure”

This paper deals with a two searchers game and it investigates the problem of how the possibility of finding a hidden object simultaneously by players influences their behavior. Namely, we consider the following two‐sided allocation non‐zero‐sum game on an integer interval [1,n]. Two teams (Player 1 and 2) want to find an immobile object (say, a treasure) hidden at one of n points. Each point i ∈ [1,n] is characterized by a detection parameter λ_i (μ_i) for Player 1 (Player 2) such that p_i(1 ? exp(?λ_ix_i)) (p_i(1 ? exp(?μ_iy_i))) is the probability that Player 1 (Player 2) discovers the hidden object with amount of search effort x_i (y_i) applied at point i where p_i ∈ (0,1) is the probability that the object is hidden at point i. Player 1 (Player 2) undertakes the search by allocating the total amount of effort X(Y). The payoff for Player 1 (Player 2) is 1 if he detects the object but his opponent does not. If both players detect the object they can share it proportionally and even can pay some share to an umpire who takes care that the players do not cheat each other, namely Player 1 gets q₁ and Player 2 gets q₂ where q₁ + q₂ ≤ 1. The Nash equilibrium of this game is found and numerical examples are given. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

优化多星协同观测的改进广义模式搜索算法

多星协同观测可以最大化卫星的整体效能,如何对多星进行部署是一个设计空间大、设计变量多的优化问题.对此,提出了基于Kriging模型的改进广义模式搜索算法.在算法的搜索步,通过代理模型最优和最大期望提高在当前网格内进行选点,避免选择的盲目性;在筛选步,利用代理模型预测筛选集中各点提高的比例并排序,减少不必要的仿真分析.最后,采用该算法对多星部署方案进行优化,通过对比发现,算法性能优于STK-Analyzer,证明了算法的可行性和有效性.     

氙原子在铂表面散射的分子动力论方法

运用分子动力论方法研究气体分子 (Xe)在固壁表面 (Pt)的散射。在构造了合理的气体分子与固壁表面相互作用势模型之后 ,运用随机经典轨道方法求解气体分子及固壁原子的运动方程 ,得到气体分子运动轨迹及散射后的运动状态。结果表明 ,气体分子散射后的角度分布与Maxwellian模型存在较大差异 ,而速度基本服从半空间的Maxwellian分布。     

集群搜索对策理论在搜索-规避对抗中的应用

使用对策论的观点和方法 ,结合搜索论的知识 ,建立了一类搜索 -规避对抗对策模型 .对模型的结论做了系统分析 ,考虑了对策双方的最优策略及使用 .